Massive memory buys little speed for complete, in-core sparse Cholesky factorization on some scalar computers
نویسندگان
چکیده
منابع مشابه
A New Approach to Parallel Sparse Cholesky Factorization on Distributed Memory Parallel Computers
Nowadays, programming distributed memory parallel computers (DMPCs) evokes the \no pain, no gain" idea. That is, for a given problem to be solved in parallel, the message passing programming model involves distributing the data and the computations among the processors. While this can be easily feasible for well structured problems, it can become fairly hard on unstructured ones, like sparse ma...
متن کاملEfficient Methods for Out-of-Core Sparse Cholesky Factorization
We consider the problem of sparse Cholesky factorization with limited main memory. The goal is to e ciently factor matrices whose Cholesky factors essentially ll the available disk storage, using very little memory (as little as 16 Mbytes). This would enable very large industrial problems to be solved with workstations of very modest cost. We consider three candidate algorithms. Each is based o...
متن کاملParallel Sparse Cholesky Factorization
Sparse matrix factorization plays an important role in many numerical algorithms. In this paper we describe a scalable parallel algorithm based on the Multifrontal Method. Computational experiments on a Parsytec CC system with 32 processors show that large sparse matrices can be factorized in only a few seconds.
متن کاملHighly Parallel Sparse Cholesky Factorization
We develop and compare several fine-grained parallel algorithms to compute the Cholesky factorisation of a sparse matrix. Our experimental implementations are on the Connection Machine, a distributedmemory SIMD machine whose programming model conceptually supplies one processor per data element. In contrast to special-purpose algorithms in which the matrix structure conforms to the connection s...
متن کاملModifying a Sparse Cholesky Factorization
Given a sparse symmetric positive definite matrix AAT and an associated sparse Cholesky factorization LDLT or LLT, we develop sparse techniques for obtaining the new factorization associated with either adding a column to A or deleting a column from A. Our techniques are based on an analysis and manipulation of the underlying graph structure and on ideas of Gill et al. [Math. Comp., 28 (1974), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1991
ISSN: 0024-3795
DOI: 10.1016/0024-3795(91)90279-6